pseudorandom code - translation to russian
математика
псевдослучайный код
![A portion of the "[[Zimmermann Telegram]]" as decrypted by [[British Naval Intelligence]] codebreakers. The word ''Arizona'' was not in the German codebook and had therefore to be split into phonetic syllables.](https://commons.wikimedia.org/wiki/Special:FilePath/Ztel2.jpg?width=200 "A portion of the \"[[Zimmermann Telegram]]\" as decrypted by [[British Naval Intelligence]] codebreakers. The word ''Arizona'' was not in the German codebook and had therefore to be split into phonetic syllables.")
Definition
Wikipedia
In theoretical computer science and cryptography, a pseudorandom generator (PRG) for a class of statistical tests is a deterministic procedure that maps a random seed to a longer pseudorandom string such that no statistical test in the class can distinguish between the output of the generator and the uniform distribution. The random seed itself is typically a short binary string drawn from the uniform distribution.
Many different classes of statistical tests have been considered in the literature, among them the class of all Boolean circuits of a given size. It is not known whether good pseudorandom generators for this class exist, but it is known that their existence is in a certain sense equivalent to (unproven) circuit lower bounds in computational complexity theory. Hence the construction of pseudorandom generators for the class of Boolean circuits of a given size rests on currently unproven hardness assumptions.
